Dynamic location problems with limited look-ahead
نویسندگان
چکیده
منابع مشابه
Dynamic location problems with limited look-ahead
The following problem arose in connection with studies of Internet web page caching. The general setting is as follows: In some fixed metric space M , k “servers” S1, . . . , Sk are given with some arbitrary initial locations in M . Requests for service at certain points σ1, σ2, σ3, . . . , σN , in M arrive over time. Immediately after request σt is received, exactly one of several mutually exc...
متن کاملLook-ahead strategies for dynamic pickup and delivery problems
In this paper we consider a dynamic full truckload pickup and delivery problem with time-windows. Jobs arrive over time and are offered in a second-price auction. Individual vehicles bid on these jobs and maintain a schedule of the jobs they have won. We propose a pricing and scheduling strategy based on dynamic programming where not only the direct costs of a job insertion are taken into accou...
متن کاملLook-Ahead Versus Look-Back for Satisfiability Problems
CNF propositional satis ability SAT is a special kind of the more general Constraint Satisfaction Problem CSP While look back techniques appear to be of little use to solve hard random SAT problems it is supposed that they are necessary to solve hard structured SAT problems In this paper we propose a very simple DPL procedure called Satz which only employs some look ahead techniques a variable ...
متن کاملFastSLAM with Look-ahead RBPF
In this paper we present an implementation of the Rao-Blackwellised particle filtering (RBPF) with one step look-ahead and apply the algorithm within the domain of agent navigation. Specifically we tackle the simultaneous localization and mapping problem (SLAM), which describes how a agent must concurrently attempt to determine its location and generate a map of the surrounding landmarks. Our i...
متن کاملLook-Ahead Value Ordering for Constraint Satisfaction Problems
Looking ahead during search is often useful when solving constraint satisfaction problems. Previous studies have shown that looking ahead helps by causing dead-ends to occur earlier in the search, and by providing information that is useful for dynamic variable ordering. In this paper, we show that another bene t of looking ahead is a useful domain value ordering heuristic, which we call look-a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00140-7